A family of 4-designs on 38 points

نویسندگان

  • Dragan M. Acketa
  • Vojislav Mudrinski
چکیده

Using the Kramer-Mesner method, 4-(26, 6, λ) designs with PSL(2, 25) as a group of automorphisms and with λ in the set {30, 51, 60, 81, 90, 111} are constructed. The search uses specific partitioning of columns of the orbit incidence matrix, related to so-called “quasi-designs”. Actions of groups PSL(2, 25), PGL(2, 25) and twisted PGL(2, 25) are being compared. It is shown that there exist 4-(26, 6, λ) designs with PGL(2, 25), respectively twisted PGL(2, 25) as a group of automorphisms and with λ in the set {51, 60, 81, 90, 111}. With λ in the set {60, 81}, there exist designs which possess all three considered groups as groups of automorphisms. An overview of t-(q + 1, k, λ) designs with PSL(2, q) as group of automorphisms and with (t, k) ∈ {(4, 5), (4, 6), (5, 6)} is included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative methods for finding nearest common fixed points of a countable family of quasi-Lipschitzian mappings

We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

متن کامل

A family of resolvable regular graph designs

A regular graph design RGD(v; k; r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either 1 or 1 +1 common blocks, for some constant 1. We investigate resolvable regular graph designs with block size 4. In particular we determine the spectrum of such designs for v 16.

متن کامل

A class of Steiner 4-wise balanced designs derived from Preparata codes

The minimum weight codewords in the Preparata code of length n = 4 m are utilized for the construction of an innnite family of Steiner S(4; f5; 6g; 4 m + 1) designs for any m 2. A t-wise balanced design with parameters t-(v; K;) is a pair (X; B) where X is a set of v points and B is a collection of subsets of X (called blocks) with sizes from the set K, such that every t-subset of X is containe...

متن کامل

On the structure of 1-designs with at most two block intersection numbers

We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of blocks into other 1-designs. We discover an infinite family of 1-designs with at most two block intersection numbers that each have a unique unrefinable decomposition, and we give a polynomial-time algorithm to compute...

متن کامل

An Investigation of the Concept of an Ideal Family from Students’ Points of View

During the last decades many governments have used formal education as a fundamental instrument for educating children and teenagers in order to promote their personal and inter-personal skills and alleviate family-related problems. Nevertheless, due attention has not been paid to this vital issue in the Iranian education system and even Fundamental Reform Document of Education has emphasized a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 1999